0.11/0.28 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.28 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s 0.13/0.50 % Computer : n021.cluster.edu 0.13/0.50 % Model : x86_64 x86_64 0.13/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.50 % Memory : 8042.1875MB 0.13/0.50 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.50 % CPULimit : 300 0.13/0.50 % WCLimit : 300 0.13/0.50 % DateTime : Fri Jul 5 04:21:39 EDT 2024 0.13/0.50 % CPUTime : 0.13/0.52 This is a THF_ problem 0.13/0.52 Running vampire_ho --cores 8 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p 0.13/0.54 % (17168)dis+10_1:128_hud=1:i=96:si=on:rtra=on_0 on theBenchmark for (2999ds/96Mi) 0.13/0.54 % (17169)lrs+10_1:2_cnfonf=off:hud=1:inj=on:i=36:si=on:rtra=on_0 on theBenchmark for (2999ds/36Mi) 0.13/0.54 % (17172)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2999ds/17Mi) 0.13/0.54 % (17171)lrs+1002_1:1_au=on:s2a=on:s2agt=32:sgt=8:ss=axioms:i=385:si=on:rtra=on_0 on theBenchmark for (2999ds/385Mi) 0.13/0.54 % (17170)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=34:si=on:rtra=on_0 on theBenchmark for (2999ds/34Mi) 0.13/0.54 % (17173)ott+1010_1:1_cnfonf=lazy_gen:fe=off:kws=inv_arity:plsq=on:plsqc=1:plsqr=32,1:prag=on:sp=const_frequency:i=74:si=on:rtra=on_0 on theBenchmark for (2999ds/74Mi) 0.13/0.54 % (17175)lrs+1002_1:14_au=on:bd=off:e2e=on:fde=unused:sac=on:sos=on:i=915:si=on:rtra=on_0 on theBenchmark for (2999ds/915Mi) 0.13/0.54 % (17169)Refutation not found, incomplete strategy 0.13/0.54 % (17169)------------------------------ 0.13/0.54 % (17169)Version: Vampire 4.7 (commit 934bd2fae on 2023-06-16 16:02:25 +0100) 0.13/0.54 % (17169)Termination reason: Refutation not found, incomplete strategy 0.13/0.54 0.13/0.54 0.13/0.54 % (17169)Memory used [KB]: 5500 0.13/0.54 % (17169)Time elapsed: 0.004 s 0.13/0.54 % (17169)Instructions burned: 4 (million) 0.13/0.54 % (17169)------------------------------ 0.13/0.54 % (17169)------------------------------ 0.13/0.54 % (17172)First to succeed. 0.13/0.54 % (17168)Also succeeded, but the first one will report. 0.13/0.54 % (17175)Refutation not found, incomplete strategy 0.13/0.54 % (17175)------------------------------ 0.13/0.54 % (17175)Version: Vampire 4.7 (commit 934bd2fae on 2023-06-16 16:02:25 +0100) 0.13/0.54 % (17175)Termination reason: Refutation not found, incomplete strategy 0.13/0.54 0.13/0.54 0.13/0.54 % (17175)Memory used [KB]: 5500 0.13/0.54 % (17175)Time elapsed: 0.005 s 0.13/0.54 % (17175)Instructions burned: 4 (million) 0.13/0.54 % (17175)------------------------------ 0.13/0.54 % (17175)------------------------------ 0.13/0.54 % (17172)Refutation found. Thanks to Tanya! 0.13/0.54 % SZS status Theorem for theBenchmark 0.13/0.54 % SZS output start Proof for theBenchmark 0.13/0.54 thf(func_def_0, type, in: $i > ($i > $o) > $o). 0.13/0.54 thf(func_def_2, type, is_a: $i > ($i > $o) > $o). 0.13/0.54 thf(func_def_3, type, emptyset: $i > $o). 0.13/0.54 thf(func_def_4, type, unord_pair: $i > $i > $i > $o). 0.13/0.54 thf(func_def_5, type, singleton: $i > $i > $o). 0.13/0.54 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o). 0.13/0.54 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o). 0.13/0.54 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o). 0.13/0.54 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o). 0.13/0.54 thf(func_def_10, type, complement: ($i > $o) > $i > $o). 0.13/0.54 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o). 0.13/0.54 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o). 0.13/0.54 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o). 0.13/0.54 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o). 0.13/0.54 thf(func_def_28, type, sK0: $i > $o). 0.13/0.54 thf(func_def_29, type, sK1: $i > $o). 0.13/0.54 thf(func_def_31, type, ph3: !>[X0: $tType]:(X0)). 0.13/0.54 thf(f121,plain,( 0.13/0.54 $false), 0.13/0.54 inference(avatar_sat_refutation,[],[f69,f74,f109,f110,f117,f118,f120])). 0.13/0.54 thf(f120,plain,( 0.13/0.54 ($true != (sK0 @ sK4)) | ($false != (sK0 @ sK4)) | ($true = $false)), 0.13/0.54 introduced(theory_tautology_sat_conflict,[])). 0.13/0.54 thf(f118,plain,( 0.13/0.54 ($true != (sK1 @ sK4)) | ((sK1 @ sK4) != $false) | ($true = $false)), 0.13/0.54 introduced(theory_tautology_sat_conflict,[])). 0.13/0.54 thf(f117,plain,( 0.13/0.54 spl2_6 | spl2_4 | spl2_1), 0.13/0.54 inference(avatar_split_clause,[],[f85,f66,f101,f112])). 0.13/0.54 thf(f112,plain,( 0.13/0.54 spl2_6 <=> ($false = (sK0 @ sK4))), 0.13/0.54 introduced(avatar_definition,[new_symbols(naming,[spl2_6])])). 0.13/0.54 thf(f101,plain,( 0.13/0.54 spl2_4 <=> ($true = (sK1 @ sK4))), 0.13/0.54 introduced(avatar_definition,[new_symbols(naming,[spl2_4])])). 0.13/0.54 thf(f66,plain,( 0.13/0.54 spl2_1 <=> ((^[Y0 : $i]: (((sK0 @ Y0) & (~ (sK1 @ Y0))) | (sK1 @ Y0))) = (^[Y0 : $i]: ((sK0 @ Y0) | (sK1 @ Y0))))), 0.13/0.54 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])). 0.13/0.54 thf(f85,plain,( 0.13/0.54 ($true = (sK1 @ sK4)) | ($false = (sK0 @ sK4)) | spl2_1), 0.13/0.54 inference(duplicate_literal_removal,[],[f84])). 0.13/0.54 thf(f84,plain,( 0.13/0.54 ($false = (sK0 @ sK4)) | ($false = (sK0 @ sK4)) | ($true = (sK1 @ sK4)) | spl2_1), 0.13/0.54 inference(binary_proxy_clausification,[],[f82])). 0.13/0.54 thf(f82,plain,( 0.13/0.54 ($true = (sK1 @ sK4)) | (((sK0 @ sK4) | (sK1 @ sK4)) = $false) | ($false = (sK0 @ sK4)) | spl2_1), 0.13/0.54 inference(not_proxy_clausification,[],[f81])). 0.13/0.54 thf(f81,plain,( 0.13/0.54 ((~ (sK1 @ sK4)) = $false) | (((sK0 @ sK4) | (sK1 @ sK4)) = $false) | ($false = (sK0 @ sK4)) | spl2_1), 0.13/0.54 inference(binary_proxy_clausification,[],[f80])). 0.13/0.54 thf(f80,plain,( 0.13/0.54 ($false = ((sK0 @ sK4) & (~ (sK1 @ sK4)))) | (((sK0 @ sK4) | (sK1 @ sK4)) = $false) | spl2_1), 0.13/0.54 inference(binary_proxy_clausification,[],[f78])). 0.13/0.54 thf(f78,plain,( 0.13/0.54 ($false = (((sK0 @ sK4) & (~ (sK1 @ sK4))) | (sK1 @ sK4))) | (((sK0 @ sK4) | (sK1 @ sK4)) = $false) | spl2_1), 0.13/0.54 inference(binary_proxy_clausification,[],[f76])). 0.13/0.54 thf(f76,plain,( 0.13/0.54 (((sK0 @ sK4) | (sK1 @ sK4)) != (((sK0 @ sK4) & (~ (sK1 @ sK4))) | (sK1 @ sK4))) | spl2_1), 0.13/0.54 inference(beta_eta_normalization,[],[f75])). 0.13/0.54 thf(f75,plain,( 0.13/0.54 (((^[Y0 : $i]: ((sK0 @ Y0) | (sK1 @ Y0))) @ sK4) != ((^[Y0 : $i]: (((sK0 @ Y0) & (~ (sK1 @ Y0))) | (sK1 @ Y0))) @ sK4)) | spl2_1), 0.13/0.54 inference(negative_extensionality,[],[f68])). 0.13/0.54 thf(f68,plain,( 0.13/0.54 ((^[Y0 : $i]: (((sK0 @ Y0) & (~ (sK1 @ Y0))) | (sK1 @ Y0))) != (^[Y0 : $i]: ((sK0 @ Y0) | (sK1 @ Y0)))) | spl2_1), 0.13/0.54 inference(avatar_component_clause,[],[f66])). 0.13/0.54 thf(f110,plain,( 0.13/0.54 spl2_5 | spl2_1), 0.13/0.54 inference(avatar_split_clause,[],[f88,f66,f105])). 0.13/0.54 thf(f105,plain,( 0.13/0.54 spl2_5 <=> ((sK1 @ sK4) = $false)), 0.13/0.54 introduced(avatar_definition,[new_symbols(naming,[spl2_5])])). 0.13/0.54 thf(f88,plain,( 0.13/0.54 ((sK1 @ sK4) = $false) | spl2_1), 0.13/0.54 inference(duplicate_literal_removal,[],[f86])). 0.13/0.54 thf(f86,plain,( 0.13/0.54 ((sK1 @ sK4) = $false) | ((sK1 @ sK4) = $false) | spl2_1), 0.13/0.54 inference(binary_proxy_clausification,[],[f79])). 0.13/0.54 thf(f79,plain,( 0.13/0.54 (((sK0 @ sK4) | (sK1 @ sK4)) = $false) | ((sK1 @ sK4) = $false) | spl2_1), 0.13/0.54 inference(binary_proxy_clausification,[],[f78])). 0.13/0.54 thf(f109,plain,( 0.13/0.54 spl2_3 | spl2_4 | spl2_1), 0.13/0.54 inference(avatar_split_clause,[],[f94,f66,f101,f97])). 0.13/0.54 thf(f97,plain,( 0.13/0.54 spl2_3 <=> ($true = (sK0 @ sK4))), 0.13/0.54 introduced(avatar_definition,[new_symbols(naming,[spl2_3])])). 0.13/0.54 thf(f94,plain,( 0.13/0.54 ($true = (sK0 @ sK4)) | ($true = (sK1 @ sK4)) | spl2_1), 0.13/0.54 inference(duplicate_literal_removal,[],[f93])). 0.13/0.54 thf(f93,plain,( 0.13/0.54 ($true = (sK0 @ sK4)) | ($true = (sK0 @ sK4)) | ($true = (sK1 @ sK4)) | spl2_1), 0.13/0.54 inference(binary_proxy_clausification,[],[f91])). 0.13/0.54 thf(f91,plain,( 0.13/0.54 ($true = (sK0 @ sK4)) | ($true = ((sK0 @ sK4) & (~ (sK1 @ sK4)))) | ($true = (sK1 @ sK4)) | spl2_1), 0.13/0.54 inference(duplicate_literal_removal,[],[f90])). 0.13/0.54 thf(f90,plain,( 0.13/0.54 ($true = ((sK0 @ sK4) & (~ (sK1 @ sK4)))) | ($true = (sK1 @ sK4)) | ($true = (sK0 @ sK4)) | ($true = (sK1 @ sK4)) | spl2_1), 0.13/0.54 inference(binary_proxy_clausification,[],[f89])). 0.13/0.54 thf(f89,plain,( 0.13/0.54 ($true = ((sK0 @ sK4) | (sK1 @ sK4))) | ($true = (sK1 @ sK4)) | ($true = ((sK0 @ sK4) & (~ (sK1 @ sK4)))) | spl2_1), 0.13/0.54 inference(binary_proxy_clausification,[],[f77])). 0.13/0.54 thf(f77,plain,( 0.13/0.54 ($true = (((sK0 @ sK4) & (~ (sK1 @ sK4))) | (sK1 @ sK4))) | ($true = ((sK0 @ sK4) | (sK1 @ sK4))) | spl2_1), 0.13/0.54 inference(binary_proxy_clausification,[],[f76])). 0.13/0.54 thf(f74,plain,( 0.13/0.54 ~spl2_2), 0.13/0.54 inference(avatar_split_clause,[],[f17,f71])). 0.13/0.54 thf(f71,plain,( 0.13/0.54 spl2_2 <=> ($true = $false)), 0.13/0.54 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])). 0.13/0.54 thf(f17,plain,( 0.13/0.54 ($true != $false)), 0.13/0.54 introduced(fool_axiom,[])). 0.13/0.54 thf(f69,plain,( 0.13/0.54 ~spl2_1), 0.13/0.54 inference(avatar_split_clause,[],[f64,f66])). 0.13/0.54 thf(f64,plain,( 0.13/0.54 ((^[Y0 : $i]: (((sK0 @ Y0) & (~ (sK1 @ Y0))) | (sK1 @ Y0))) != (^[Y0 : $i]: ((sK0 @ Y0) | (sK1 @ Y0))))), 0.13/0.54 inference(beta_eta_normalization,[],[f63])). 0.13/0.54 thf(f63,plain,( 0.13/0.54 (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))) @ sK1 @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (~ (Y1 @ Y2)))))))) @ sK0 @ sK1)) != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))) @ sK1 @ sK0))), 0.13/0.54 inference(definition_unfolding,[],[f60,f61,f61,f52])). 0.13/0.55 thf(f52,plain,( 0.13/0.55 (setminus = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (~ (Y1 @ Y2)))))))))), 0.13/0.55 inference(cnf_transformation,[],[f23])). 0.13/0.55 thf(f23,plain,( 0.13/0.55 (setminus = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y0 @ Y2) & (~ (Y1 @ Y2)))))))))), 0.13/0.55 inference(fool_elimination,[],[f22])). 0.13/0.55 thf(f22,plain,( 0.13/0.55 (setminus = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : (~(X1 @ X2) & (X0 @ X2))))), 0.13/0.55 inference(rectify,[],[f9])). 0.13/0.55 thf(f9,axiom,( 0.13/0.55 (setminus = (^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : (~(X2 @ X3) & (X0 @ X3))))), 0.13/0.55 file('/export/starexec/sandbox/benchmark/theBenchmark.p',setminus)). 0.13/0.55 thf(f61,plain,( 0.13/0.55 (union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))), 0.13/0.55 inference(cnf_transformation,[],[f19])). 0.13/0.55 thf(f19,plain,( 0.13/0.55 (union = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) | (Y0 @ Y2))))))))), 0.13/0.55 inference(fool_elimination,[],[f18])). 0.13/0.55 thf(f18,plain,( 0.13/0.55 (union = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) | (X1 @ X2))))), 0.13/0.55 inference(rectify,[],[f6])). 0.13/0.55 thf(f6,axiom,( 0.13/0.55 (union = (^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((X0 @ X3) | (X2 @ X3))))), 0.13/0.55 file('/export/starexec/sandbox/benchmark/theBenchmark.p',union)). 0.13/0.55 thf(f60,plain,( 0.13/0.55 ((union @ sK1 @ sK0) != (union @ sK1 @ (setminus @ sK0 @ sK1)))), 0.13/0.55 inference(cnf_transformation,[],[f46])). 0.13/0.55 thf(f46,plain,( 0.13/0.55 ((union @ sK1 @ sK0) != (union @ sK1 @ (setminus @ sK0 @ sK1)))), 0.13/0.55 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f44,f45])). 0.13/0.55 thf(f45,plain,( 0.13/0.55 ? [X0 : $i > $o,X1 : $i > $o] : ((union @ X1 @ X0) != (union @ X1 @ (setminus @ X0 @ X1))) => ((union @ sK1 @ sK0) != (union @ sK1 @ (setminus @ sK0 @ sK1)))), 0.13/0.55 introduced(choice_axiom,[])). 0.13/0.55 thf(f44,plain,( 0.13/0.55 ? [X0 : $i > $o,X1 : $i > $o] : ((union @ X1 @ X0) != (union @ X1 @ (setminus @ X0 @ X1)))), 0.13/0.55 inference(ennf_transformation,[],[f43])). 0.13/0.55 thf(f43,plain,( 0.13/0.55 ~! [X0 : $i > $o,X1 : $i > $o] : ((union @ X1 @ X0) = (union @ X1 @ (setminus @ X0 @ X1)))), 0.13/0.55 inference(rectify,[],[f16])). 0.13/0.55 thf(f16,negated_conjecture,( 0.13/0.55 ~! [X2 : $i > $o,X0 : $i > $o] : ((union @ X0 @ (setminus @ X2 @ X0)) = (union @ X0 @ X2))), 0.13/0.55 inference(negated_conjecture,[],[f15])). 0.13/0.55 thf(f15,conjecture,( 0.13/0.55 ! [X2 : $i > $o,X0 : $i > $o] : ((union @ X0 @ (setminus @ X2 @ X0)) = (union @ X0 @ X2))), 0.13/0.55 file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm)). 0.13/0.55 % SZS output end Proof for theBenchmark 0.13/0.55 % (17172)------------------------------ 0.13/0.55 % (17172)Version: Vampire 4.7 (commit 934bd2fae on 2023-06-16 16:02:25 +0100) 0.13/0.55 % (17172)Termination reason: Refutation 0.13/0.55 0.13/0.55 % (17172)Memory used [KB]: 5500 0.13/0.55 % (17172)Time elapsed: 0.007 s 0.13/0.55 % (17172)Instructions burned: 4 (million) 0.13/0.55 % (17172)------------------------------ 0.13/0.55 % (17172)------------------------------ 0.13/0.55 % (17167)Success in time 0.009 s 0.13/0.55 % Vampire---4.8 exiting 0.13/0.55 EOF